Multiplicative Homomorphic E-Voting
نویسندگان
چکیده
All the currently existing homomorphic e-voting schemes are based on additive homomorphism. In this paper a new e-voting scheme based on multiplicative homomorphism is proposed. In the tallying phase, a decryption is performed to recover the product of the votes, instead of the sum of them (as in the additive homomorphic e-voting schemes). Then, the product is factorized to recover the votes. The new e-voting scheme is more efficient than the additive homomorphic e-voting schemes and more efficient than other voting schemes when the number of candidates is small. Strong vote privacy and public verifiability are obtained in the new e-voting scheme.
منابع مشابه
A Homomorphic Crypto System for Electronic Election Schemes
This research investigates the applications of homomorphic encryption systems in electronic voting schemes. We make use of Paillier cryptosystem which exhibits additive homomorphic properties. The other homomorphic cryptosystems RSA and Elgamal are not considered, since they exhibit only multiplicative homomorphic property. Our proposed method increases the level of security when compared to El...
متن کاملMultiplicative Homomorphic E-Auction with Formally Provable Security
A new method, homomorphic e-auction based on multiplicative homomorphic encryption algorithm like ElGamal encryption is proposed in this paper. Its advantage is obvious and useful in practice: efficient distributed private key generation and thus efficient trust sharing. A long existing problem in homomorphic e-auction, inefficiency of bid validity check, is solved in the new multiplicative hom...
متن کاملEfficient Proof of Vote Validity Without Honest-Verifier Assumption in Homomorphic E-Voting
Vote validity proof and verification is an efficiency bottleneck and privacy drawback in homomorphic e-voting. The existing vote validity proof technique is inefficient and only achieves honest-verifier zero knowledge. In this paper, an efficient proof and verification technique is proposed to guarantee vote validity in homomorphic e-voting. The new proof technique is mainly based on hash funct...
متن کاملSecure Electronic Voting Protocols
This chapter gives a summary of cryptographic e-voting protocols. We start with a motivation and an overview of some aspects of traditional elections. We then outline the security requirements of e-voting and present in detail two approaches to cryptographic e-voting, based on homomorphic encryption and mix networks. We finish the chapter with a list of open problems.
متن کاملDesign and Implementation of Secure Remote e-Voting System Using Homomorphic Encryption
Internet polling also known as “e-voting” became popular in past few years, since it reduces the tallying cost and time, increases the number of voter participation, also reduces the human resources and the traditional work that means less fraud and corruption. In this paper, a remote e-Voting system is designed and implemented using homomorphic encryption. The homomorphic property in ElGamal c...
متن کامل